Recent Progress in Complex Network Analysis: Properties of Random Intersection Graphs
نویسندگان
چکیده
Experimental results show that in large complex networks (such as internet, social or biological networks) there exists a tendency to connect elements which have a common neighbor. In theoretical random graph models, this tendency is described by the clustering coefficient being bounded away from zero. Complex networks also have power-law degree distributions and short average distances (small world phenomena). These are desirable features of random graphs used for modeling real life networks. We survey recent results concerning various random intersection graph models showing that they have tunable clustering coefficient, a rich class of degree distributions including power-laws, and short average distances.
منابع مشابه
Recent Progress in Complex Network Analysis: Models of Random Intersection Graphs
Experimental results show that in large complex networks such as internet or biological networks, there is a tendency to connect elements which have a common neighbor. This tendency in theoretical random graph models is depicted by the asymptotically constant clustering coefficient. Moreover complex networks have power law degree distribution and small diameter (small world phenomena), thus the...
متن کاملRandom intersection graphs and their applications in security, wireless communication, and social networks
Random intersection graphs have received much interest and been used in diverse applications. They are naturally induced in modeling secure sensor networks under random key predistribution schemes, as well as in modeling the topologies of social networks including common-interest networks, collaboration networks, and actor networks. Simply put, a random intersection graph is constructed by assi...
متن کاملOn k-Connectivity and Minimum Vertex Degree in Random s-Intersection Graphs
Random s-intersection graphs have recently received much interest in a wide range of application areas. Broadly speaking, a random s-intersection graph is constructed by first assigning each vertex a set of items in some random manner, and then putting an undirected edge between all pairs of vertices that share at least s items (the graph is called a random intersection graph when s = 1). A spe...
متن کاملIntersection graphs associated with semigroup acts
The intersection graph $mathbb{Int}(A)$ of an $S$-act $A$ over a semigroup $S$ is an undirected simple graph whose vertices are non-trivial subacts of $A$, and two distinct vertices are adjacent if and only if they have a non-empty intersection. In this paper, we study some graph-theoretic properties of $mathbb{Int}(A)$ in connection to some algebraic properties of $A$. It is proved that the fi...
متن کاملComponent Evolution in Random Intersection Graphs
We study the evolution of the order of the largest component in the random intersection graph model which reflects some clustering properties of real–world networks. We show that for appropriate choice of the parameters random intersection graphs differ from Gn,p in that neither the so-called giant component, appearing when the expected vertex degree gets larger than one, has linear order nor i...
متن کامل